Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach

نویسنده

  • Tobias Harks
چکیده

In this paper, we present a novel approach to the congestion control and resource allocation problem of elastic and real-time traffic in telecommunication networks. With the concept of utility functions, where each source uses a utility function to evaluate the benefit from achieving a transmission rate, we interpret the resource allocation problem as a global optimization problem. The solution to this problem is characterized by a new fairness criterion, utility proportional fairness. We argue that it is an application level performance measure, i.e. the utility that should be shared fairly among users. As a result of our analysis, we obtain congestion control laws at links and sources that are globally stable and provide a utility proportional fair resource allocation in equilibrium. We show that a utility proportional fair resource allocation also ensures utility max-min fairness for all users sharing a single path in the network. As a special case of our framework, we incorporate utility max-min fairness for the entire network. To implement our approach, neither per-flow state at the routers nor explicit feedback beside ECN (Explicit Congestion Notification) from the routers to the end-systems is required.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fair and efficient dynamic bandwidth allocation for multi-application networks

The large diversity of applications and requirements posed to current network environments make the resource allocation problem difficult to work out. This paper proposes a dynamic algorithm based on weighted fair queueing (WFQ) to promote fairness (in the Rawlsian sense) and efficiency (in the Paretian sense) in the allocation of bandwidth for multi-application networks. Utility functions are ...

متن کامل

Fair allocation of utilities in multirate multicast networks: a framework for unifying diverse fairness objectives

We study fairness in a multicast network. We assume that different receivers of the same session can receive information at different rates. We study fair allocation of utilities, where utility of a bandwidth is an arbitrary function of the bandwidth. The utility function is not strictly increasing, nor continuous in general. We discuss fairness issues in this general context. Fair allocation o...

متن کامل

Harmonic Proportional Bandwidth Allocation for Service Differentiation on Streaming Servers

Recent advance of real-time audio/video transcoding technology enables streaming servers to manage the constrained network-I/O bandwidth available to the Internet at a fine-grained level. In this article, we propose a bandwidth allocation mechanism for differentiated services (DiffServ) on the streaming servers. It aims to deliver high bit rate streams to high priority requests without overcomp...

متن کامل

Semi-Definite Programming for bandwidth allocation in communication networks

We aim at assigning bandwidth fairly to calls that have minimum bandwidth requirements. Our goal is to provide a general computational tool based on Semi-Definite Programming (SDP). The advantage of our approach is that many appealing complex objective functions related to fairness criteria are special cases of our formalism. Therefore, such optimization problems can be solved in an automatic m...

متن کامل

A game-theoretic model for capacity-constrained fair bandwidth allocation

Data stream providers face a hard decision to satisfy the requirements of their subscribers. Each user has a minimum and a maximum required bandwidth. The server should be able to decide which requests can be satisfi ed and how much bandwidth will be allocated to each. We present a theoretical framework in a distributed mechanism for fair bandwidth allocation on a network with various bottlenec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005